An accurate SVD algorithm for 2 by 2 triangular matrices ∗
نویسنده
چکیده
Using a fine accuracy analysis and the results from [9], a new accurate algorithm for computing the singular value decomposition of 2 by 2 triangular matrices is constructed. It is obtained by combining the new algorithm which is derived in [9] and the algorithm which is coded as an xLASV2 computational routine of LAPACK. Relative error bounds for the output data of the hybrid algorithm are equal to or smaller than the same bounds for any of these two algorithms. AMS subject classifications: 65F15, 65G05
منابع مشابه
New Fast and Accurate Jacobi Svd Algorithm: Ii. Lapack Working Note 170
This paper presents new implementation of one–sided Jacobi SVD for triangular matrices and its use as the core routine in a new preconditioned Jacobi SVD algorithm, recently proposed by the authors. New pivot strategy exploits the triangular form and uses the fact that the input triangular matrix is the result of rank revealing QR factorization. If used in the preconditioned Jacobi SVD algorith...
متن کاملNew Fast and Accurate Jacobi SVD Algorithm. II
This paper presents new implementation of one–sided Jacobi SVD for triangular matrices and its use as the core routine in a new preconditioned Jacobi SVD algorithm, recently proposed by the authors. New pivot strategy exploits the triangular form and uses the fact that the input triangular matrix is the result of rank revealing QR factorization. If used in the preconditioned Jacobi SVD algorith...
متن کاملComputing the Singular Values of 2-by-2 Complex Matrices
The singular value decomposition (SVD) of a 2-by-2 complex matrix does not occur as frequently as that of a 2-by-2 real upper triangular matrix. The commonly used QR method for SVD consists of two stages. In the first stage, a matrix is reduced to bidiagonal form using, say, Householder transformations on both sides. In the second stage, the bidiagonal matrix resulted from the first stage is di...
متن کاملA practical application of kernel-based fuzzy discriminant analysis
A novel method for feature extraction and recognition called Kernel Fuzzy Discriminant Analysis (KFDA) is proposed in this paper to deal with recognition problems, e.g., for images. The KFDA method is obtained by combining the advantages of fuzzy methods and a kernel trick. Based on the orthogonal-triangular decomposition of a matrix and Singular Value Decomposition (SVD), two different variant...
متن کاملScaled Iterates by Kogbetliantz Method
Scaled iterates associated with the serial Kogbetliantz method for computing the singular value decomposition (SVD) of complex triangular matrices are considered. They are defined by B (k) S = |diag(B )| B |diag(B)|, where B are matrices generated by the method. Sharp estimates are derived for the Frobenius norm of the off-diagonal part of B (k) S , in the case of simple singular values. This n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010